
#include <iostream>
#include <queue>
#include <vector>
#include <deque>
#include <list>

using namespace std;

int main(){
//	priority_queue<int> pq;			ok
//	priority_queue<int, list<int> > pq;	err
//	priority_queue<int, deque<int> > pq;	ok
	priority_queue<int, vector<int>, greater<int> > pq;
	pq.push(3);
	pq.push(30);
	pq.push(7);
	pq.push(12);
	pq.push(8);
	pq.push(10);
	pq.push(1);

	while(!pq.empty()){
		cout << pq.top() << endl;
		pq.pop();
	}

	return 0;
}
